package test5;

import java.util.Scanner;

public class Solution1 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println("请输入每列网格数m：");
        int m = sc.nextInt();
        System.out.println("请输入每行网格数n：");
        int n = sc.nextInt();
        System.out.println("请输入网格布局：");
        int[][] obstacleGrid = new int[m][n];
        for(int i = 0; i < m; i++){
            for (int j = 0; j < n; j++) {
                obstacleGrid[i][j] = sc.nextInt();
            }
        }
        int result = uniquePathsWithObstacles(obstacleGrid);
        System.out.println("从左上角到右下角共有" + result + "条路径");
    }

    private static int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int m = obstacleGrid.length;
        int n = obstacleGrid[0].length;
        int[][] dp = new int[m][n];
        for(int i = 0; i < m; i++){
            if(obstacleGrid[i][0] == 1){//遇到障碍后续都不通
                break;
            }
            dp[i][0] = 1;
        }
        for(int i = 0; i < n; i++){
            if(obstacleGrid[0][i] == 1){//遇到障碍后续都不通
                break;
            }
            dp[0][i] = 1;
        }
        for(int i = 1; i < m; i++){
            for(int j = 1; j < n; j++){
                if(obstacleGrid[i][j] == 0){//没有障碍时
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
                }
            }
        }
        return dp[m - 1][n - 1];
    }
}
